Laplacians on Shifted Multicomplexes
نویسنده
چکیده
The Laplacian of an undirected graph is a square matrix, whose eigenvalues yield important information. We can regard graphs as one-dimensional simplicial complexes, and as whether there is a generalisation of the Laplacian operator to simplicial complexes. It turns out that there is, and that is useful for calculating real Betti numbers [8]. Duval and Reiner [5] have studied Laplacians of a special class of simplicial complexes, the so called shifted simplicial complexes. They show that such Laplacians have integral spectra, computeable by a simple combinatorial formula. Snellman [11] studied a family of monomial algebras, corresponding to truncations of the ring of arithmetical functions with Dirichlet convolution. The defining monomial ideals turn out to be strongly stable, which makes it possible to use the so-called Eliahou-Kervaire resolution [7] to calculate the Betti numbers of the ideals. Now, simplicial ideals correspond to square-free monomial ideals, or differently put, to monomial ideals in the exterior alegbra. Shifted simplicial complexes correspond to strongly stable square-free ideals. Monomial ideals, on the other hand, correspond to so-called multicomplexes. One is naturally led to the question: is there a way to define Laplacian operators on finite multicomplexes, and if so, is there a simple formula for their spectra in the case of multicomplexes corresponding to strongly stable monomial ideals? The Laplacian operator on simplicial complexes is defined as Ld = ∂d+1∂ ∗ d+1, (1)
منابع مشابه
Finite Filtrations of Modules and Shellable Multicomplexes
We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially CohenMacaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.
متن کاملCriterions for Shellable Multicomplexes
After [4] the shellability of multicomplexes Γ is given in terms of some special faces of Γ called facets. Here we give a criterion for the shellability in terms of maximal facets. Multigraded pretty clean filtration is the algebraic counterpart of a shellable multicomplex. We give also a criterion for the existence of a multigraded pretty clean filtration.
متن کاملSpheres arising from multicomplexes
In 1992, Thomas Bier introduced a surprisingly simply way to construct a large number of simplicial spheres. He proved that, for any simplicial complex ∆ on the vertex set V with ∆ 6= 2 , the deleted join of ∆ with its Alexander dual ∆∨ is a combinatorial sphere. In this paper, we extend Bier’s construction to multicomplexes, and study their combinatorial and algebraic properties. We show that ...
متن کاملRelaxations of the matroid axioms I: Independence, Exchange and Circuits
Motivated by a question of Duval and Reiner about higher Laplacians of simplicial complexes, we describe various relaxations of the defining axioms of matroid theory to obtain larger classes of simplicial complexes that contain pure shifted simplicial complexes. The resulting classes retain some of the matroid properties and allow us to classify matroid properties according to the relevant axio...
متن کاملHigh-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...
متن کامل